Correlated decoding for channels with arbitrarily varying channel probability functions
نویسندگان
چکیده
منابع مشابه
Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions
Let X = I1, " '" , a}, Y = {1, ' " , b} be finite sets. A stochastic matrix w with a rows and b columns will be called a channel. X, Y are the input and output alphabets (respectively) of the channel. We denote the set of all channels with input alphabet X and output alphabet Y by e (X, Y). A channel w E C (X, Y) can be used for communication from one person, the sender, to another person, the ...
متن کاملChannels with Arbitrarily Varying Channel Probability Functions in the Presence of Noiseless Feedback
In this article we study a channel with arbitrarily varying channel probability functions in the presence of a noiseless feedback channel (a. v. ch. f.). We determine its capacity by proving a coding theorem and its strong converse. Our proof of the coding theorem is constructive; we give explicitly a coding scheme which performs at any rate below the capacity with an arbitrarily small decoding...
متن کاملThe Capacity of a Channel with Arbitrarily Varying Channel Probability Functions and Binary Output Alphabet*
" r? Let X~= X and Y~= Y for t = 1, 2 . . . . . X, ,= ~ X ~ and !1, = Y~. Let S be any set, cg = {w(. 1" I s ) lseS} t = l t = l n be a set of (a x 2) stochastic matrices w( ' l ' ls) , and St=S , t= 1 . . . . . n. For every sn=(s 1 . . . . . s " ) e H S t n t = l define P (. ]" Is.) by P (y.[x.ls.) = I~ w (yt]x~lst) for every x. = (x a . . . . . x")~ X . and every y. = (yl, ... , y.)e 11.. t =...
متن کاملCapacity and decoding rules for classes of arbitrarily varying channels
Ahstrucf -We consider the capacity of an arbitrarily varying channel (AVC) for deterministic codes with the average probability of error critenon and, typically, subject to a state constraint. First, sufficient conditions are provided that enable (relatively) simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy)...
متن کاملMIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel States
In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wire...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1969
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(69)90157-0